Quantum Computing is Getting Real

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Getting real with Real Options

We apply a utility–based method to obtain the value of a finite–time investment opportunity when the underlying real asset is not perfectly correlated to a traded financial asset. Using a discrete–time algorithm to calculate the indifference price for this type of real option, we present numerical examples for the corresponding investment thresholds, in particular highlighting their dependence ...

متن کامل

Keynote speaker: Getting real

Wide-FOV, 6DOF-tracked, consumer head-worn displays are no longer just dev kits, bimanual 3D input devices can be found at Best Buy, and full-fledged graphics packages are built into web browsers. Meanwhile, augmented reality is poised to make the return trip from hand-held phones and tablets, back to the head-worn displays in which it was born. 3D is here for real. Yet, we all know how difficu...

متن کامل

Computing quantum discord is NP-complete

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum disc...

متن کامل

Getting real about virtual commerce.

In its first generation, electronic commerce has been a landgrab. Space on the Internet was claimed by whoever got there first with enough resources to create a credible business. It took speed, a willingness to experiment, and a lot of cybersavvy. Companies that had performed brilliantly in traditional settings seemed hopelessly flat-footed on the Web. And despite their astronomical valuations...

متن کامل

Finding resource states of measurement-based quantum computing is harder than quantum computing

Measurement-based quantum computing enables universal quantum computing with only adaptive single-qubit measurements on certain many-qubit states, such as the graph state, the AffleckKennedy-Lieb-Tasaki (AKLT) state, and several tensor-network states. Finding new resource states of measurement-based quantum computing is a hard task, since for a given state there are exponentially many possible ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 2018

ISSN: 0362-1340,1558-1160

DOI: 10.1145/3296957.3177152